package com.example.leetcode.dp;

import com.example.leetcode.dp.common.DPUtils;

class Solution221 {
    public int maximalSquare(char[][] matrix) {
        return DPUtils.maximalSquare(matrix);
    }
}

public class leetcode221 {
    public static void main(String[] args) {
        Solution221 solution221 = new Solution221();
        char[][] matrix = {
                {'1', '0', '1', '0', '0'},
                {'1', '0', '1', '1', '1'},
                {'1', '1', '1', '1', '1'},
                {'1', '0', '0', '1', '0'}
        };
        char[][] matrix1 = {{'0', '1'}, {'1', '0'}};
//        System.out.println(solution221.maximalSquare(matrix));
        System.out.println(solution221.maximalSquare(matrix1));
    }
}
